Rules and derivations
ثبت نشده
چکیده
• Functor categories can combine with their arguments by the following rules: (2) Forward application (>) X/Y Y ⇒ X (3) Backward application (<) Y X\Y ⇒ X • Derivations are written as shown below, on the left side. Note the direct correspondence to the upside-down constituency tree shown on the right.
منابع مشابه
An Overview of Lexical Phonology
This article reviews Lexical Phonology, a theory of rules and derivations. Rules are of three types: cyclic rules, postcyclic rules, and postlexical rules. Various diagnostic properties of rules are discussed, including the phonological cycle, word vs. phrase domain application, the Strict Cyclicity Constraint, derived environments, the Structure Preservation Constraint, lexical conditioning, a...
متن کاملInvited Talk: On the Concurrent Semantics of Transformation Systems with Negative Application Conditions
A rich concurrent semantics has been developed along the years for graph transformation systems, often generalizing in non-trivial ways concepts and results first introduced for Petri nets. Besides the theoretical elegance, the concurrent semantics has potential applications in verification and model checking, as witnessed by techniques like partial order reduction or the use of finite, complet...
متن کاملMorphological Productivity in the Lexicon
In this paper we outline a lexical organization for Turkish that makes use of lexical rules for inflections, derivations, and lexical category changes to control the proliferation of lexical entries. Lexical rules handle changes in grammatical roles, enforce type constraints, and control the mapping of subcategorization frames in valency changing operations. A lexical inheritance hierarchy faci...
متن کاملAbstract Termination of Linear Rewriting Systems* -preliminary Version
TERMINATION OF LINEAR REWRITING SYSTEMS* preliminary version Nachum Dershowitz Department of Computer Science University of Illinois Urbana, Illinois 61801 U.S.A. Limitations, such as right-linearity, on the form of rules in a termrewriting system are shown to restrict the class of derivations that must be considered when determining whether or not the system terminates for all inputs. These re...
متن کاملEmbedding formalisms: hypersequents and two-level systems of rule
A system of rules consists of (possibly labelled) sequent rules connected to each other by some variables and subject to the condition of appearing in a certain order in the derivation. The formalism of systems of rules is quite powerful and allows, e.g., the definition of analytic labelled sequent calculi for intermediate and modal logics characterised by frame conditions beyond the geometric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004